Left Termination proof of /tmp/tmpbct9lY/insert-bbf.pl

Left Termination of the query pattern insert_in_3(g, g, a) w.r.t. the given Prolog program could successfully be proven:

↳ Prolog

  ↳ PrologToPiTRSProof

Clauses:

insert(X, void, tree(X, void, void)).
insert(X, tree(X, Left, Right), tree(X, Left, Right)).
insert(X, tree(Y, Left, Right), tree(Y, Left1, Right)) :- ','(less(X, Y), insert(X, Left, Left1)).
insert(X, tree(Y, Left, Right), tree(Y, Left, Right1)) :- ','(less(Y, X), insert(X, Right, Right1)).
less(0, s(X)).
less(s(X), s(Y)) :- less(X, Y).

Queries:

insert(g,g,a).

We use the technique of [30]. With regard to the inferred argument filtering the predicates were used in the following modes:
insert_in: (b,b,f)
less_in: (b,b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

insert_in_gga(X, void, tree(X, void, void)) → insert_out_gga(X, void, tree(X, void, void))
insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) → insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y))
less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))
U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X))
U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1))
U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right))

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

insert_in_gga(X, void, tree(X, void, void)) → insert_out_gga(X, void, tree(X, void, void))
insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) → insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y))
less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))
U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X))
U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1))
U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right))

INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_GGA(X, Y, Left, Right, Left1, less_in_gg(X, Y))
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → LESS_IN_GG(X, Y)
LESS_IN_GG(s(X), s(Y)) → U5_GG(X, Y, less_in_gg(X, Y))
LESS_IN_GG(s(X), s(Y)) → LESS_IN_GG(X, Y)
U1_GGA(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_GGA(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
U1_GGA(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → INSERT_IN_GGA(X, Left, Left1)
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_GGA(X, Y, Left, Right, Right1, less_in_gg(Y, X))
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → LESS_IN_GG(Y, X)
U3_GGA(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_GGA(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U3_GGA(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → INSERT_IN_GGA(X, Right, Right1)

The TRS R consists of the following rules:

insert_in_gga(X, void, tree(X, void, void)) → insert_out_gga(X, void, tree(X, void, void))
insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) → insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y))
less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))
U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X))
U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1))
U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right))

The argument filtering Pi contains the following mapping:
insert_in_gga(x1, x2, x3) = insert_in_gga(x1, x2)
void = void
insert_out_gga(x1, x2, x3) = insert_out_gga(x3)
tree(x1, x2, x3) = tree(x1, x2, x3)
U1_gga(x1, x2, x3, x4, x5, x6) = U1_gga(x1, x2, x3, x4, x6)
less_in_gg(x1, x2) = less_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
less_out_gg(x1, x2) = less_out_gg
U5_gg(x1, x2, x3) = U5_gg(x3)
U2_gga(x1, x2, x3, x4, x5, x6) = U2_gga(x2, x4, x6)
U3_gga(x1, x2, x3, x4, x5, x6) = U3_gga(x1, x2, x3, x4, x6)
U4_gga(x1, x2, x3, x4, x5, x6) = U4_gga(x2, x3, x6)
U5_GG(x1, x2, x3) = U5_GG(x3)
LESS_IN_GG(x1, x2) = LESS_IN_GG(x1, x2)
U1_GGA(x1, x2, x3, x4, x5, x6) = U1_GGA(x1, x2, x3, x4, x6)
INSERT_IN_GGA(x1, x2, x3) = INSERT_IN_GGA(x1, x2)
U2_GGA(x1, x2, x3, x4, x5, x6) = U2_GGA(x2, x4, x6)
U4_GGA(x1, x2, x3, x4, x5, x6) = U4_GGA(x2, x3, x6)
U3_GGA(x1, x2, x3, x4, x5, x6) = U3_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_GGA(X, Y, Left, Right, Left1, less_in_gg(X, Y))
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → LESS_IN_GG(X, Y)
LESS_IN_GG(s(X), s(Y)) → U5_GG(X, Y, less_in_gg(X, Y))
LESS_IN_GG(s(X), s(Y)) → LESS_IN_GG(X, Y)
U1_GGA(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_GGA(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
U1_GGA(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → INSERT_IN_GGA(X, Left, Left1)
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_GGA(X, Y, Left, Right, Right1, less_in_gg(Y, X))
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → LESS_IN_GG(Y, X)
U3_GGA(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_GGA(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U3_GGA(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → INSERT_IN_GGA(X, Right, Right1)

The TRS R consists of the following rules:

insert_in_gga(X, void, tree(X, void, void)) → insert_out_gga(X, void, tree(X, void, void))
insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) → insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y))
less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))
U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X))
U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1))
U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right))

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN_GG(s(X), s(Y)) → LESS_IN_GG(X, Y)

The TRS R consists of the following rules:

insert_in_gga(X, void, tree(X, void, void)) → insert_out_gga(X, void, tree(X, void, void))
insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) → insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y))
less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))
U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X))
U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1))
U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right))

The argument filtering Pi contains the following mapping:
insert_in_gga(x1, x2, x3) = insert_in_gga(x1, x2)
void = void
insert_out_gga(x1, x2, x3) = insert_out_gga(x3)
tree(x1, x2, x3) = tree(x1, x2, x3)
U1_gga(x1, x2, x3, x4, x5, x6) = U1_gga(x1, x2, x3, x4, x6)
less_in_gg(x1, x2) = less_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
less_out_gg(x1, x2) = less_out_gg
U5_gg(x1, x2, x3) = U5_gg(x3)
U2_gga(x1, x2, x3, x4, x5, x6) = U2_gga(x2, x4, x6)
U3_gga(x1, x2, x3, x4, x5, x6) = U3_gga(x1, x2, x3, x4, x6)
U4_gga(x1, x2, x3, x4, x5, x6) = U4_gga(x2, x3, x6)
LESS_IN_GG(x1, x2) = LESS_IN_GG(x1, x2)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN_GG(s(X), s(Y)) → LESS_IN_GG(X, Y)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

LESS_IN_GG(s(X), s(Y)) → LESS_IN_GG(X, Y)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LESS_IN_GG(s(X), s(Y)) → LESS_IN_GG(X, Y)
The graph contains the following edges 1 > 1, 2 > 2

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

U1_GGA(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → INSERT_IN_GGA(X, Left, Left1)
U3_GGA(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → INSERT_IN_GGA(X, Right, Right1)
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_GGA(X, Y, Left, Right, Right1, less_in_gg(Y, X))
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_GGA(X, Y, Left, Right, Left1, less_in_gg(X, Y))

The TRS R consists of the following rules:

insert_in_gga(X, void, tree(X, void, void)) → insert_out_gga(X, void, tree(X, void, void))
insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) → insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y))
less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))
U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1))
insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X))
U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1))
U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1))
U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) → insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right))

The argument filtering Pi contains the following mapping:
insert_in_gga(x1, x2, x3) = insert_in_gga(x1, x2)
void = void
insert_out_gga(x1, x2, x3) = insert_out_gga(x3)
tree(x1, x2, x3) = tree(x1, x2, x3)
U1_gga(x1, x2, x3, x4, x5, x6) = U1_gga(x1, x2, x3, x4, x6)
less_in_gg(x1, x2) = less_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
less_out_gg(x1, x2) = less_out_gg
U5_gg(x1, x2, x3) = U5_gg(x3)
U2_gga(x1, x2, x3, x4, x5, x6) = U2_gga(x2, x4, x6)
U3_gga(x1, x2, x3, x4, x5, x6) = U3_gga(x1, x2, x3, x4, x6)
U4_gga(x1, x2, x3, x4, x5, x6) = U4_gga(x2, x3, x6)
U1_GGA(x1, x2, x3, x4, x5, x6) = U1_GGA(x1, x2, x3, x4, x6)
INSERT_IN_GGA(x1, x2, x3) = INSERT_IN_GGA(x1, x2)
U3_GGA(x1, x2, x3, x4, x5, x6) = U3_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

U1_GGA(X, Y, Left, Right, Left1, less_out_gg(X, Y)) → INSERT_IN_GGA(X, Left, Left1)
U3_GGA(X, Y, Left, Right, Right1, less_out_gg(Y, X)) → INSERT_IN_GGA(X, Right, Right1)
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left, Right1)) → U3_GGA(X, Y, Left, Right, Right1, less_in_gg(Y, X))
INSERT_IN_GGA(X, tree(Y, Left, Right), tree(Y, Left1, Right)) → U1_GGA(X, Y, Left, Right, Left1, less_in_gg(X, Y))

The TRS R consists of the following rules:

less_in_gg(0, s(X)) → less_out_gg(0, s(X))
less_in_gg(s(X), s(Y)) → U5_gg(X, Y, less_in_gg(X, Y))
U5_gg(X, Y, less_out_gg(X, Y)) → less_out_gg(s(X), s(Y))

The argument filtering Pi contains the following mapping:
tree(x1, x2, x3) = tree(x1, x2, x3)
less_in_gg(x1, x2) = less_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
less_out_gg(x1, x2) = less_out_gg
U5_gg(x1, x2, x3) = U5_gg(x3)
U1_GGA(x1, x2, x3, x4, x5, x6) = U1_GGA(x1, x2, x3, x4, x6)
INSERT_IN_GGA(x1, x2, x3) = INSERT_IN_GGA(x1, x2)
U3_GGA(x1, x2, x3, x4, x5, x6) = U3_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

U1_GGA(X, Y, Left, Right, less_out_gg) → INSERT_IN_GGA(X, Left)
INSERT_IN_GGA(X, tree(Y, Left, Right)) → U1_GGA(X, Y, Left, Right, less_in_gg(X, Y))
INSERT_IN_GGA(X, tree(Y, Left, Right)) → U3_GGA(X, Y, Left, Right, less_in_gg(Y, X))
U3_GGA(X, Y, Left, Right, less_out_gg) → INSERT_IN_GGA(X, Right)

The TRS R consists of the following rules:

less_in_gg(0, s(X)) → less_out_gg
less_in_gg(s(X), s(Y)) → U5_gg(less_in_gg(X, Y))
U5_gg(less_out_gg) → less_out_gg

The set Q consists of the following terms:

less_in_gg(x0, x1)
U5_gg(x0)

We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

INSERT_IN_GGA(X, tree(Y, Left, Right)) → U1_GGA(X, Y, Left, Right, less_in_gg(X, Y))
The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 2 > 4
INSERT_IN_GGA(X, tree(Y, Left, Right)) → U3_GGA(X, Y, Left, Right, less_in_gg(Y, X))
The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 2 > 4
U3_GGA(X, Y, Left, Right, less_out_gg) → INSERT_IN_GGA(X, Right)
The graph contains the following edges 1 >= 1, 4 >= 2
U1_GGA(X, Y, Left, Right, less_out_gg) → INSERT_IN_GGA(X, Left)
The graph contains the following edges 1 >= 1, 3 >= 2